package org.lql.algo.codecrush.week001;

/**
 * @author: liangqinglong
 * @date: 2025-07-22 14:57
 * @description: 344. 反转字符串 <a href="https://leetcode.cn/problems/reverse-string/description/">...</a>
 **/
public class ReverseString {

	/**
	 * 编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 s 的形式给出。
	 * <p>
	 * 不要给另外的数组分配额外的空间，你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
	 * <p>
	 * 示例 1：
	 * <p>
	 * 输入：s = ["h","e","l","l","o"]
	 * 输出：["o","l","l","e","h"]
	 * 示例 2：
	 * <p>
	 * 输入：s = ["H","a","n","n","a","h"]
	 * 输出：["h","a","n","n","a","H"]
	 */
	public void reverseString(char[] s) {
		int n = s.length;
		for (int i = 0, j = n - 1; i < j; i++, j--) {
			char tmp = s[i];
			s[i] = s[j];
			s[j] = tmp;
		}
	}

	public static void main(String[] args) {
		ReverseString reverseString = new ReverseString();
		char[] s = new char[]{'h', 'e', 'l', 'l', 'o'};
		reverseString.reverseString(s);
		System.out.println(s);
	}
}
